Solving Sudoku Puzzles with Particle Swarm Optimisation
نویسنده
چکیده
This workshop paper addresses Heuristic approaches to solving Sudoku puzzles, with particular focus on Particle Swarm Optimisation(PSO). Sudoku problems and their constraints will be discussed. Heuristics used to solve Sudoku will be identified. We will then propose a component framework for supporting PSO and other Heuristics. Doing so allows us to separately detail aspects of PSO such as initialisation, optimisation, randomisation and the fitness function separately. Conclusions are drawn, implications drawn for the other Heuristics, and suggestions for further work are made.
منابع مشابه
SudokuBee: An Artificial Bee Colony-based Approach in Solving Sudoku puzzles
Sudoku is a popular newspaper puzzle that has become an international phenomenon. Sudoku which means “single digits” is a logicbased combinatorial puzzle with rules that are quite simple. Several algorithms have been used to solve this combinatorial optimization problem. This paper explores the possibility of using the Artificial Bee Colony (ABC) algorithm, a relatively new swarm-based optimiza...
متن کاملFinding solutions to sudoku puzzles using human intuitive heuristics
Sudoku is a logical puzzle that has achieved international popularity. Given this, there have been a number of computer solvers developed for this puzzle. Various methods including genetic algorithms, simulated annealing, particle swarm optimization and harmony search have been evaluated for this purpose. The approach described in this paper combines human intuition and optimization to solve Su...
متن کاملGeometric Particle SwarmOptimization
Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimisation (PSO) and evolutionary algorithms. This connection enables us to generalise PSO to virtually any solution representation in a natural and straightforward way. The new geometric PSO (GPSO) applies naturally to both continuous and combinatorial...
متن کاملA novel hybrid genetic algorithm for solving Sudoku puzzles
In this article, a novel hybrid genetic algorithm is proposed. The selection operator, crossover operator andmutation operator of the genetic algorithm have effectively been improved according to features of Sudoku puzzles. The improved selection operator has impaired the similarity of the selected chromosome and optimal chromosome in the current population such that the chromosome with more ab...
متن کاملAre Evolutionary Algorithms Required to Solve Sudoku Problems?
Sudoku puzzles are an excellent testbed for evolutionary algorithms. The puzzles are accessible enough to be enjoyed by people. However the more complex puzzles require thousands of iterations before a solution is found by an evolutionary algorithm. If we were attempting to compare evolutionary algorithms we could count their iterations to solution as a indicator of relative efficiency. However...
متن کامل